Two criteria in Fermat infinite descent method
نویسندگان
چکیده
منابع مشابه
The Method of Infinite Descent in Stable
This paper is a continuation of [Rav02] and the second in a series of papers intended to clarify and expand results of the last chapter of [Rav04], in which we described a method for computing the Adams-Novikov E2-term and used it to determine the stable homotopy groups of spheres through dimension 108 for p = 3 and 999 for p = 5. The latter computation was a substantial improvement over prior ...
متن کاملThe Method of Infinite Descent in Stable Homotopy Theory I
This paper is the first in a series aimed at clarifying and extending of parts of the last chapter of [Rav86], in which we described a method for computing the AdamsNovikov E2-term and used it to determine the stable homotopy groups of spheres through dimension 108 for p = 3 and 999 for p = 5. The latter computation was a substantial improvement over prior knowledge, and neither has been improv...
متن کاملPartial Descent on Hyperelliptic Curves and the Generalized Fermat Equation
Let C : y = f(x) be a hyperelliptic curve defined over Q. Let K be a number field and suppose f factors over K as a product of irreducible polynomials f = f1f2 . . . fr. We shall define a “Selmer set” corresponding to this factorization with the property that if it is empty then C(Q) = ∅. We shall demonstrate the effectiveness of our new method by solving the generalized Fermat equation with si...
متن کاملInfinite Descent on Elliptic Curves
We present an algorithm for computing an upper bound for the difference of the logarithmic height and the canonical height on elliptic curves. Moreover a new method for performing the infinite descent on elliptic curves is given, using ideas from the geometry of numbers. These algorithms are practical and are demonstrated by a few examples.
متن کاملThe Fermat factorization method revisited
We consider the well known Fermat factorization method, we call the Fermat factorization equation the equation solved by it: P(x, y) = (x+ 2R) − y − 4N = 0; where N = p q > 0 is a RSA modulus with primes p and q supposed of equal length. This equation is a bivariate integer polynomial equation and we propose to solve it directly using Coppersmith’s methods for bivariate integer polynomials. As ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Open Science Journal
سال: 2017
ISSN: 2466-4308
DOI: 10.23954/osj.v2i4.1278